Galambos Péter élete

Péter Major

This paper discusses an interesting result of Lata la [3] about the tail behaviour of Gaussian polynomials. I found it useful to present a new, more detailed version of Lata la’s rather concise proof by putting emphasis on its main ideas. I applied several ideas of the original work, but introduced some different arguments as well. I tried to explain the method of the proof by discussing the pi...

Bonferroni-Galambos Inequalities for Partition Lattices

In this paper, we establish a new analogue of the classical Bonferroni inequalities and their improvements by Galambos for sums of type ∑ π∈P(U)(−1)(|π| − 1)!f(π) where U is a finite set, P(U) is the partition lattice of U and f : P(U) → R is some suitable non-negative function. Applications of this new analogue are given to counting connected k-uniform hypergraphs, network reliability, and cum...

Subwords in reverse - complement order - Extended abstract ∗ Péter

We examine finite words over an alphabet Γ = {a, ā; b, b̄} of pairs of letters, where each word w1w2...wt is identified with its reverse complement w̄t...w̄2w̄1 (where ā = a, b̄ = b). We seek the smallest k such that every word of length n, composed from Γ, is uniquely ∗This work was supported, in part, by Hungarian NSF, under contract Nos. AT48826, NK62321, F043772, N34040, T34702, T37846, T43758, ...

Theorems af Péter and Parsons in Computer Programming

Inequalities of Bonferroni-galambos Type with Applications to the Tutte Polynomial and the Chromatic Polynomial

In this paper, we generalize the classical Bonferroni inequalities and their improvements by Galambos to sums of type ∑ I⊆U (−1)|I|f(I) where U is a finite set and f : 2 → R. The result is applied to the Tutte polynomial of a matroid and the chromatic polynomial of a graph.